Probabilistic Methods in Extremal Finite Set Theory
نویسنده
چکیده
There are many known applications of the Probabilistic Method in Extremal Finite Set Theory. In this paper we describe several examples, demonstrating some of the techniques used and illustrating some of the typical results obtained. This is partly a survey paper, but it also contains various new results. ∗Research supported in part by a United States Israel BSF Grant and by a Bergmann Memorial Grant
منابع مشابه
Methods and Challenges in Extremal and Probabilistic Combinatorics∗ Organizers
Combinatorics, or discrete mathematics, is a fundamental mathematical discipline, concerned with the study of discrete mathematical objects such as graphs, set families and permutations, their typical and extremal properties, and their enumeration. A natural mathematical framework for a large variety of human activities and endeavors, combinatorics has been in existence for thousands of years. ...
متن کاملProblems and results in Extremal Combinatorics, Part I
Extremal Combinatorics is an area in Discrete Mathematics that has developed spectacularly during the last decades. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems suggested by various researchers in Extremal Graph Theory, Extremal Finite Set Theory and Combinatorial Geometry. This is not meant to be a comprehensive...
متن کاملOn the Existence of Extremal Cones and Comparative Probability Orderings
We study the recently discovered phenomenon [1] of existence of comparative probability orderings on finite sets that violate Fishburn hypothesis [2, 3] — we call such orderings and the discrete cones associated with them extremal. Conder and Slinko constructed an extremal discrete cone on the set of n = 7 elements and showed that no extremal cones exist on the set of n ≤ 6 elements. In this pa...
متن کاملProbabilistic and Extremal Combinatorics∗ Organizers
Combinatorics, sometimes also called Discrete Mathematics, is a branch of mathematics focusing on the study of discrete objects and their properties. Although Combinatorics is probably as old as the human ability to count, the field experienced tremendous growth during the last fifty years and has matured into a thriving area with its own set of problems, approaches and methodology. Extremal an...
متن کاملExtremal and Probabilistic Combinatorics
09:20 – 09:30 Opening remarks 09:30 – 10:00 Dhruv Mubayi Quasirandom hypergraphs 10:05 – 10:35 Yufei Zhao Sparse regularity and counting in pseudorandom graphs 10:35 – 11:15 Coffee 11:15 – 11:45 Asaf Shapira Exact bounds for some hypergraph saturation problems 11:50 – 12:20 Po-Shen Loh Computing with voting trees 12:20 – 14:30 Lunch 14:30 – 15:00 Joel Spencer Six standard deviations still suffi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991